# -*- coding: UTF-8 -*-
import heapq
from typing import List
from leetcode_helper import TestcaseHelper, SolutionBase


class Solution(SolutionBase):
    # 解题的方法，命名和Leetcode的保持一致即可
    def maxSlidingWindow(self, nums: List[int], k: int) -> List[int]:
        nums_count = len(nums)
        ans = []
        p_queue = []

        # 初始化第一个滑动窗口
        for i in range(0, k):
            heapq.heappush(p_queue, (-nums[i], i))
        ans.append(-p_queue[0][0])

        for i in range(k, nums_count):
            heapq.heappush(p_queue, (-nums[i], i))
            # 将不在当前滑动窗口中的元素弹出
            while p_queue[0][1] <= i - k:
                heapq.heappop(p_queue)

            ans.append(-p_queue[0][0])
        return ans


if __name__ == '__main__':
    solution = Solution()

    # 按照leetcode的题目说明，将基本的test case填入
    # 每条case的最后一个元素是正确的结果，即期待的结果
    # 使用元组来保存输入的数据，期待的结果
    testcases = [
        ([1, 3, -1, -3, 5, 3, 6, 7], 3, [3, 3, 5, 5, 6, 7]),
        ([1], 1, [1]),
        ([1, -1], 1, [1, -1])
    ]

    for case_item in testcases:
        # 获取测试用的case和期待的执行结果
        input1 = case_item[0]
        input2 = case_item[1]

        expect = case_item[len(case_item) - 1]
        exec_result = solution.maxSlidingWindow(input1, input2)

        # 判断执行结果，输出提示信息
        check_result = solution.check_result(expect, exec_result)
        TestcaseHelper.print_case(check_result, case_item, exec_result)

